Reducibility of n-ary semigroups: from quasitriviality towards idempotency

On reducibility of n-ary quasigroups

An n-ary operation Q : Σ → Σ is called an n-ary quasigroup of order |Σ| if in the equation x0 = Q(x1, . . . , xn) knowledge of any n elements of x0, . . . , xn uniquely specifies the remaining one. Q is permutably reducible if Q(x1, . . . , xn) = P ( R(xσ(1), . . . , xσ(k)), xσ(k+1), . . . , xσ(n) ) where P and R are (n− k+1)-ary and kary quasigroups, σ is a permutation, and 1 < k < n. Anm-ary ...

On reducibility of n-ary quasigroups, II

An n-ary operation Q : Σ → Σ is called an n-ary quasigroup of order |Σ| if in the equation x0 = Q(x1, . . . , xn) knowledge of any n elements of x0, . . . , xn uniquely specifies the remaining one. Q is permutably reducible ifQ(x1, . . . , xn) = P ` R(xσ(1), . . . , xσ(k)), xσ(k+1), . . . , xσ(n) ́ where P and R are (n − k + 1)-ary and k-ary quasigroups, σ is a permutation, and 1 < k < n. An m-a...

n–ary hyperstructures constructed from binary quasi–ordered semigroups

Based on works by Davvaz, Vougiouklis and Leoreanu-Fotea in the field of n–ary hyperstructures and binary relations we present a construction of n–ary hyperstructures from binary quasi-ordered semigroups. We not only construct the hyperstructures but also study their important elements such as identities, scalar identities or zeros. We also relate the results to earlier results obtained for a s...

On absorption in semigroups and n-ary semigroups

The notion of absorption was developed a few years ago by Barto and Kozik and immediately found many applications, particularly in topics related to the constraint satisfaction problem. We investigate the behavior of absorption in semigroups and n-ary semigroups (that is, algebras with one n-ary associative operation). In the case of semigroups, we give a simple necessary and sufficient conditi...

On $n$-ary Hypergroups and Fuzzy $n$-ary Homomorphism